Profiling Attack against RSA Key Generation Based on a Euclidean Algorithm

A profiling attack is a powerful variant among the noninvasive side channel attacks. In this work, we target RSA key generation relying on binary version of extended Euclidean algorithm for modular inverse and GCD computations. To date, has only been exploited by simple power analysis; therefore, countermeasures described in literature are focused mitigating kind attack. We demonstrate that one those not effective preventing The feasibility our approach relies extraction several leakage vectors from single trace. Moreover, because there known relationships between secrets public modulo RSA, uncertainty some guessed can be reduced tests. This increases effectiveness proposed